Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem
نویسندگان
چکیده
The nurse rostering problem is an important search problem that features many constraints. In a nurse rostering problem, these constraints are defined by processes such as maintaining work regulations, assigning nurse shifts, and considering nurse preferences. A number of approaches to address these constraints, such as penalty function methods, have been investigated in the literature. We propose two types of hybrid metaheuristic approaches for solving the nurse rostering problem, which are based on combining harmony search techniques and artificial immune systems to balance local and global searches and prevent slow convergence speeds and prematurity. The proposed algorithms are evaluated against a benchmarking dataset of nurse rostering problems; the results show that they identify better or best known solutions compared to those identified in other studies for most instances. The results also show that the combination of harmony search and artificial immune systems is better suited than using single metaheuristic or other hybridization methods for finding upper-bound solutions for nurse rostering problems and discrete optimization problems.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملSolving the Nurse Rostering Problem Knowledge Representation and Reasoning Seminar
Nurse rostering is a complex problem which affects the everyday activities and health care tasks in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. The goal is to find a quality assignment of shift categories to available nurses. Even though solving the Nurse Rostering Problem has been a field of interest o...
متن کاملA Constraint-directed Local Search Approach to Nurse Rostering Problems
In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iterati...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کاملA constraint programming based column generation approach to nurse rostering problems
This paper presents our investigations on a hybrid constraint programming based column generation (CP-CG) approach to nurse rostering problems. We present a complete model to formulate all the complex real-world constraints in several benchmark nurse rostering problems. The hybrid CP-CG approach is featured with not only the effective relaxation and optimality reasoning of linear programming bu...
متن کامل